Characterizing the Redundancy of Universal Source Coding for Finite-length Sequences
نویسندگان
چکیده
To my parents. iii ACKNOWLEDGEMENTS Foremost, I would like to express my sincere gratitude to my research advisor Prof. Faramarz Fekri for his continuous encouragement, advice, and guidance. Throughout the last two years, I have enjoyed his company as a supportive and insightful friend rather than a formal research advisor. My sincere thanks go to my incredible friends Amir Hossein, Mehrsa, and Reza who have been there for me through the difficult times and have provided me with nonstop support and caring. discussions and the fun we have had in the lab during the past couple of years. place to live. I also would like to acknowledge my other friends who are spread all over support, encouragement, enthusiasm that has made my life much more enjoyable. Last but not least, this thesis would not have been possible if it was not for the support and motivation of my family throughout my life: my dad Karim, my mom Farah, and my sister Elnaz. I also would like to thank my aunts and uncles Fariba,
منابع مشابه
Variable-Rate Coding with Feedback for Universal Communication Systems
Classical coding schemes that rely on joint typicality (such as Slepian-Wolf coding and channel coding) assume known statistics and rely on asymptotically long sequences. However, in practice the statistics are unknown, and the sequences are of finite length n. In this finite regime, we must allow a non-zero probability of coding error and also pay a penalty by transmitting extra bits. The pena...
متن کاملUniversal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کاملUniversal noiseless coding
A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is...
متن کاملGeneralized Shannon Code Minimizes the Maximal Redundancy
Source coding, also known as data compression, is an area of information theory that deals with the design and performance evaluation of optimal codes for data compression. In 1952 Hu man constructed his optimal code that minimizes the average code length among all pre x codes for known sources. Actually, Hu man codes minimizes the average redundancy de ned as the di erence between the code len...
متن کاملRedundancy Rates of Slepian-Wolf Coding∗
The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in design of distributed source codes, along with the need for distributed compression in sensor networks, has made it crucial to understand how quickly distributed communication systems can approach their ultimate limits. Slepian and Wolf considered the distributed enco...
متن کامل